COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	PAMPHLETS ON SHELF left side
C00038 ENDMK
C⊗;
PAMPHLETS ON SHELF left side

Air Force Office of Scientific Research\Program areas for research funding\

Alpert, Jack,\Future imaging skills and usstainable societies\

Amarel, Saul\Problems of representation in heuristic problem solving;
  related issues in the development of expert systems\Rutgers Univ.\1981.

American Physical Society\ Nuclear energy.  Light water reactor safety\             
  Review of Modern Physics\Summer 1975.

Apt, Francez and de Roever\A proof system for communicating sequential processes\
  Unknonw\1970.

Archer, Rowland F.\Representation and analysis of real-time control structures\
  MIT, Lab for Computer Sciences\September, l980.

Banerji, Ranan\A logic in which one learns programs from examples\Temple University\
  Unknown.

Barendregt and Longo\Recursion theoretic operators and morphisms on numbered sets\
  MIT\1981.

Barwise and Perry, SITUATIONS AND ATTITUDES, 

Baskett, Forrest, Bechtolsheim, Andrew, Nowicki, Susan, and Seamons,\
  The SUN workstation\Stanford Univ.\Unknown.

Belovari, Gabor\How the monkey gets the banana - an experiemnt in procedural logic
  representation\Unknown\1981.

Ben-Ari, Halpern, and Pnueli, A. A Deterministic propositional dynamic logic:
  finite models, complexity, and completeness\MIT\1981.

Bentley et al\Two papers on computational geometry\ C-M Univ.\ March 1980.

Berliner, Hans\Some observations on problem solving\C-M U.\April l980.

Boley, Harold\Five views of fit programming\ Fachbereich Informatik\Unknown.

Bowen, Kenneth\Programming with full first order logic\Unknown\Unknown.

Bowen, K. A., and Kowalski, R. A.\Amalgamating language and metalanguage in logic
  programming\Unknown\Unknown.

Bower, David, J.R. LUCAS\Kurt Godel and Fred Astaire\St. Cloud State U.\January 1981
 
Boyd, David M.\Labor, materials and energy payback for eleven energy production
  technologies\Mitre Corp.\May l980.

Boyer,R. A. and Moore\A verification condition generator for Fortran\SRI\June 1980.

Boyer,R. A.and Moore\A theorem-prover for recursive functions: a user's manual, SRI\
  1979.

Brillhart, John\Note on representing a prime as a sum of two squares\Unknown\Unknown.

Broy, Partsch, Pepper, and Wirsing\Semantic relations in programming languages\
  Unknown\Unknown.

Buchenberger, B.\Publication of working group on computer aided mathematical 
  problem solving\Johannes Kepler Univ.\1981.

Bundy, Alan and Sterling, Leon\Meta-level inference in algebra\DAI Research Paper\
  1981.

Campbell, Donald T.\Descriptive epistemology:  psychological, sociological, 
  and evolutionary\Northwestern Univ.\1977.

Carlin and Campbell\Polymorphism in subdivided populations\Unknown\Unknown.

Carroll and Thomas\Metaphor and the cognitive representation of computing systems\
  IBM\May 1980.

Chomsky, Noam\Rules and representations\MIT\1979.

Clark, K. L.\An introduction to logic programming\Imperial College\1981.

Clark, K. L.\Negation as failure\Queen Mary College\Unknown.

Clark, K.L.and Darlington\Algorithm classification through synthesis\Imperial
  College of Science and Technology\1978.

Clark, K. L., and McCabe, F. G.\PROLOG: a language for implementing expert systems\
  Imperial College\1980.

Clark, McKeeman and Sickel\Logic program specification of numerical integration,
  Unknown\Unknown.

Clark, Keith and Tarnlund, Sten-ake\A first order theory of data and programs\
  Unknown\1977.

Coelho, H. and Pereira, L. M.\GEOM: a PROLOG geometry theorem prover\Univ. of 
Lisbon\1979.

Cohen, Benjamin, UNDERSTANDING NATURAL KINDS: PART 1.  Xerox, Palo Alto, 1981

Cohen, Donald, KNOWLEDGE BASED THEOREM PROVING AND LEARNING, C-M U. April l980

Colmerauer, Alain, AN INTERESTING SUBSET OF NATURAL LANGUAGE, Aix, 1977

Colmerauer, Alain, PROLOG AND THE INFINITE TREES.  Aix, 1980

Couquaux, FRENCH PREDICATION AND LINGUISTIC THEORY.  Marseilles

Crangle, Colleen, FORMALIZING KNOWLEDGE OF PERSONS, 1981


Creary, Lewis G., CAUSAL EXPLANATION AND THE REALITY OF NATURAL COMPONENT FORCES

Dahl, Veronica, TOWARDS CONSTRUCTIVE DATA BASES, Buenos Aires University

Darlington and Waldinger, CASE STUDIES IN PROGRAM TRANSFORMATION AND SYNTHESIS,
  SRI, 1978

de Bruijn, N. G., A SURVEY OF THE PROJECT AUTOMATH

d'Espagnat, Bernard, THE QUANTUM THEORY AND REALITY, 

Dedijer, S.  TOWARDS OF THEORY OF SOCIAL INTELLIGENCE BY WAY OF BIOLOGICAL,
  ARTIFICIAL, AND GOVERNMENTAL INTELLIGENCE.  Lund U., April 1981

Dennett, D.C., INTENTIAL SYSTEMS IN COGNITIVE ETHOLOGY:  the "PANGLOSSIAN
  PARADIGM" DEFEMDED. Draft, November l981

Dennett, D.C., THREE KINDS OF INTENTIONAL PSYCHOLOGY, 1979

Dickens and Rockowitz, REPORT ON LARGE SCALE ACADEMIC COMPUTING, Task Force
  on Computing at Stanford, 1981.  SLAC.  CIT Text Network

Doyle, Jon, NON-MONOTONIC LOGICS AND MECHANIZED NON-DEDUCTIVE REASONING
  Draft, Stanford, 1981.

Dworkis, Charles, EXPERIMENTS IN ELEMENTARY RULEBASED REASONING, Logicon, 1981

Elcock, E. W., LOGIC AND PROGRAMMING METHODOLOGY, U. of Western Ontario, 

Eliashberg, Victor, THE CONCEPT OF E-MACHINE: ON BRAIN HARDWARE AND THE
  ALGORITHMS OF THINKING.  Proc. of Cong of Cogn. Sci., 1981.
	Russian

Papers on ENERGY STATEMENT. April 1981.  SE2

Fahlman, Scott, A PLANNING SYSTEM FOR ROBOT CONSTRUCTION TASKS, MIT, 1973

Farinas del Cerro, Luis, DEDUCTION AUTOMATIQUE ET LOGIQUE MODALE, U. of Paris, 1981

Feather, Martin, FORMAL SPECIFICATION OF A REAL SYSTEM.USC/ISI, July l980

Feferman, Solomon, INDUCTIVELY PRESENTED SYSTEMS AND THE FORMALIZATION OF
  META-MATHEMATICS, 

Feldman, Jerry, A DISTRIBUTED INFORMATION PROCESSING MODEL OF VISUAL MEMORY,
  1979

Feng Yu-lin, PROGRAMMING LOGIC AND PROGRAM CORRECTNESS PROOF.  Tang student.

Firdman MANUSCRIPT.  January 1981.

Fischer, Meyer, Paterson, LOWER BOUNDS ON LENGTH OF BOOLEAN FORMULAS

Fodor, J. A., METHODOLOGICAL SOLIPSISM CONSIDERED AS A RESEARCH STRATEGY
  IN COGNITIVE PSYCHOLOGY, Cambridge Press, 1979 (See Searle's reply)

Francez, N., AN APPLICATION OF A METHOD FOR ANALYSIS OF CYCLIC PROGRAMS,
  1978
	re: elephant

Francez, Hoare, Lehmann, and de Roever, SEMANTICS OF NONDETERMINISM, CONCURRENCY
  AND COMMUNICATION, 1978

Francez and Pnueli, A PROOF METHOD FOR CYCLIC PROGRAMS, Weizmann Institute, 1978
	re: elephant

Francez and Rodeh, ACHIEVING DISTRIBUTED TERMINATION WITHOUT FREEZING, Israel
  Scientific Center, 1979

Friedman and Wise, A NOTE ON CONDITIONAL EXPRESSIONS, Programming Languages, 1978

Friedman and Wise, AN ENVIRONMENT FOR MULTIPLE-VALUED RECURSIVE PROCEDURES, 1975

Friedman and Wise, AN INDETERMINATE CONSTRUCTOR FOR APPLICATIVE PROGRMMMING,
  Indiana U., 1980

Friedman and Wise, AN APPROACH TO FAIR APPLICATIVE MULTIPROGRAMMING, 1979

Friedman and Wise, APPLICATIVE MULTIPROGRAMMING, INDIANA U., 1979

Friedman and Wise, APPLICATIVE PROGRAMMING FOR SYSTEMS, 1978

Friedman and Wise, ASPECTS OF APPLICATIVE PROGAMMING FOR FILE SYSTEMS, 1978

Friedman and Wise, ASPECTS OF APPLICATIVE PROGRAMMING FOR PARALLET PROCESSING, 1978

Friedman and Wise, CONS SHOULD NOT EVALUATE ITS ARGUMENTS, Automata Languages and
  Programming, Edinburgh U., 1976

Friedman and Wise, FANCY FERNS REQUIRE LITTLE CARE, 1981

Friedman and Wise, FUNCTIONAL COMBINATION, 1978

Friedman and Wise, GARBAGE COLLECTING A HEAP WHICH INCLUDES A SCATTER TABLE, 1976

Friedman and Wise, INTERLOCK-FREE STORE INSTRUCTION, Indiana U., 1980

Friedman and Wise, OUTPUT DRIVEN INTERPRETATION OF RECURSIVE PROGRAMS, OR WRITING
  CREATES AND DESTROYS DATA STRUCTURES, 1976

Friedman, Wise and Wand, RECURSIVE PROGRAMMING THROUGH TABLE LOOKUP, Indiana U.,1976

Friedman and Wise, REFERENCE COUNTING CAN MANAGE THE CIRCULAR INVIRONMENTS OF
  MUTUAL RECURSION, Information Processing Letters, Vol. 8, No. 1, January 1979

Friedman and Wise, UNBOUNDED COMPUTATIONAL STRUCTURES, Indiana U., 1978

Gabbay, Pnueli, Shelah, and Stavi, ON THE TEMPORAL ANALYSIS OF FAIRNESS, 1980

Gallaire, H., IMPACTS OF LOGIC ON DATA BASES, Marcoussis, 1981

Gallaire, H. and Lasserre, C., METALEVELCONTROL FOR LOGIC PROGRAMS, 
  Marcoussis
 
Goldin, S. and Thorndyke, P., IMPROVING TEAM PERFORMANCE:  PROCEEDINGS OF THE
  RAMD TEAM PERFORMANCE WORKSHOP.  R-2606-ONR, August 1980.

Goldman and Wile, A DATABASE FOUNDATION FOR PROCESS SPECIFICATIONS

Goodwin and Hein, ARTIFICIAL INTELLIGENCE AND THE STUDY OF LANGUAGE, 1980
  Linkoping University, Sweden

Goguen, J. A.  HOW TO PROVE ALGEBRAIC INDUCTIVE HYPOTHESES WITHOUT INDUCTION.
  SRI, January 1980.
	re: hand behind back

Goguen and Meseguer, COMPLETENESS OF MANY SORTED EQUATIONAL LOGIC.  SRI,
  
Green, Cordell, RESEARCH ON PROGRAM UNDERSTANDING SYSTEMS, Stanford, 1975

Green, Cordell, THE APPLICATION OF THEOREM PROVING TO QUESTION-ANSWERING SYSTEMS

Grimshaw, Jane, ON THE LEXICAL REPRESENTATION OF ROMANCE REFLEXIVE CLITICS, 1979

Grismer, Thomas, SOLVING COMMON PROGRAMMING PROBLEMS WITH AN APPPLICATIVE 
  PROGRAMMING LANGUAGE, Indiana U., 1981

Hagert and Tarnlund, DEDUCTIVE MODELING OF HUMAN COGNITION,Uppsala U., 1:81

Hansson and Tarnlund, PROGRAM TRANSFORMATION BY DATA STRUCTURE MAPPING, Uppsala U.,
  1981

Hare, R.M., JUSTICE AND EQUALITY, 1978

Hare, R. M., RIGHTS AND JUSTICE

Hart, H.A.L., ASCRIPTION OF RESPONSIBILITY AND RIGHTS

Haugeland, John, FORMALITY AND NATURALISM, CASBS

Haugeland, John, Ed., MIND DESIGN, PHILOSOPHY, PSYCHOLOGY, ARTIFICIAL INTELLIGENCE,
  CASBS. 1981

Hayes-Roth,Klahr, & Mostow, KNOWLEDGE ACQUISITION, KNOWLEDGE PROGRAMMING, AND
  KNOWLEDGE REFINEMENT.NSF, May 1980

Herman, Martin, UNDERSTANDING BODY POSTURES OF HUMAN STICK FIGURES.  U. of
  Maryland, November 1979.

Herskovits, Annette, SPACE, PREPOSITIONS, AND SITUATION TYPES, 1979

Hewitt and Baker, THE SEMANTICS OF ACTIONS AND THE SEMANTICS OF TRUTH

Hewitt, Carl, VIEWING CONTROL STRUCTURES AS PATTERNS OF PASSING MESSAGES, MIT
  Lab, 1976

Hewitt, Carl, BEHAVIORAL SEMANTICS OF NONRECURSIVE CONTROL STRUCTURES, MIT
  Lab, 1974

Hewitt and Baker, LAWS FOR COMMUNICATING PARALLEL  PROCESSES, IFIP, 1977

Hewitt and Smith, TOWARDS AN PROGRAMMING APPRENTICE

Hoover Institution, June 1980.  ENERGY ALTERNATIVES

Hurd, Cuthbert, EARLY IBM COMPUTERS, 1981

ICASE, Semi-annual Report, 1980

IFIP Working Group 2.2, Peniscola, Spain, April 1981.  MINUTES

IIASA CONFERENCE '80 REVIEW AND OUTLOOK.  HANDLER

Ingemarsson and Wong, A USER AUTHENTICATION SCHEME FOR SHARED DATA BASED ON A 
  TRAP DOOR ONE WAY.  IBM, May 1980

Ito, T., A DESIGN THEORY OF RECOGNITION FUNCTIONS IN SELF-ORGANIZING SYSTEMS,
  Reprinted from IEEE Transactions on Eelctronic Computers, 1965

Jackson and Shuet, TIME AND SPACE PROPERTIES OF SOME B-TREE VARIANTS

Jefferson, David, DTYPE REDUCTION AND PROGRAM VERIFICATION. C-M U.  April 1980

Johnson, Steven D., CIRCUITS AND SYSTEMS: IMPLEMENTING COMMUNICATION WITH STREAMS,
  Indiana U., 1981

Johnson, Steven D., CONNECTION NETWORKS FOR OUTPUT-DRIVEN LIST MULTIPROCESSING
  Indiana U., 1981

Kahn, K. M., UNIFORM - A LANGUAGE BASED UPON UNIFICATION WHICH UNIFIES (MUCH OF)
  LISP, PROLOG, AND ACT I, U. of Uppsala, 1981

Kahneman & Twersky, ON THE PSYCHOLOGY OF PREDICTION. Psychological Review,
  July l973

Kamorowksi and Goodwin, EMBEDDING PROLOG IN LISP: AND EXAMPLE OF A LISP CRAFT
  TECHNIQUE, Linkoping U., 1981

Kamorowski, H. Jan, QLOG - THE SOFTWARE FOR PROLOG AND LOGIC PROGRAMMING
  Sweden, April l980

Kelley, John A.D., THE CONFINES OF COSMOPOLITAN JUSTICE, Stanford Journal
  of International Law, 1980

Kowalski, Robert, LOGIC AS A DATABASE LANGUAGE, Imperial College, July 1981

Kowalski, Robert, PROLOG AS A LOGIC PROGRAMMING LANGUAGE, Imperial College.
  July 1981
  
Kovsky, Robert, ENGINEER'S GUIDE TO LEGAL MATERIALS
                A DEVICE FOR "DATA STRUCTURES"
                DATA STRUCTURES IN LEGAL MATERIALS, Parts I and II

Kreisel, Georg, NEGLECTED POSSIBILITIES OF PROCESSING ASSERTIONS AND PROOFS
  MECHANICALLY:  CHOICE OF PROBLEMS AND DATA.  1980

Knuth, Donald E., DECIPHERING A LINEAR CONGRUENTIAL ENCRYPTION, 1980. ONR

Lamport, L., TIMESETS, A NEW METHOD FOR TEMPORAL REASONING ABOUT PROGRAMS,
  SRI, 1980
	re: elephant

Lankford, D.S., SOME REMARKS ABOUT INDUCTIONLESS INDUCTION, 1980
	re: hand behind back

Lenat, Douglas, BEINGS: REPRESENTATION OF KNOWLEDGE AS INTERACTING MODULES, 1974

Lieberman and Hewitt, A REAL TIME GARBAGE COLLECTOR

London, Ralph L., A CORRECTNESS PROF OF THE FISHER-GALLER ALGORITHM USING 
  INDUCTIVE ASSERTIONS, Tech. Report, U. of Wisconsin, 1970

London, Ralph L., BIBLIOGRAPHY ON PROVING THE CORRECTNESS OF COMPUTER PROGRAMS -
  ADDITION NO. 1, Tech. Report, U. of Wisconsin, 1970

London, Ralph L., CORRECTNESS OF TWO COMPILERS FOR A LISP SUBSET, Stanford, 1971

London, Ralph. L., EXPERIENCE WITH INDUCTIVE ASSERTIONS FOR PROVING PROGRAMS 
  CORRECT, Tech. Report, U. ov Wisconsin, 1970

Maida and Shapiro, INTENSIONAL CONCEPTS IN PROPOSITIONAL SEMANTIC NETWORKS,
  SUNY at Buffalo, 1981

Mann and Moore, COMPUTER AS AUTHOR - RESULTS AND PROSPECTS, U. of Southern 
  California, 1980

Manna, Zohar, INDUCTIVE MTHODS FOR PROVING PROPERTIES OF PROGRAMS, Stanford, 1971

Manna, Zohar, and Pnueli, Amir, VERIFICATION OF CONCURRENT PROGRAMS, PART I:
  THE TEMPORAL FRAMEWORK, Stanford, 1981

Martin-Lof, Per, CONSTRUCTIVE MATHEMATICS AND COMPUTER PROGRAMMING.  U. of
  Stockholm, August 1979

Mayr, Ernst, AN EFFECTIVE REPRESENTATION OF THE REACHABILITY SET OF PERSISTENT
  PETRI NETS, 1981, MIT

McCarthy, Feigenbaum, and Samuel, PROPOSAL FOR CONTINUATION OF THE STANFORD
  ARTIFICIAL INTELLIGENCE PROJECT

McCarthy, John, EFFECTIVE INTERACTIVE USE OF LARGE CHARACTER SETS

McCarthy, John, BASIC RESEARCH IN ARTIFICIAL INTELLIGENCE AND FOUNDATIONS
  OF PROGRAMMING.  AIM 337, Stanford, California.  September l980

McCarthy, John, MARSEILLES SPEECH TO FRENCH UNIVERSITY PRESIDENTS, 1981

McDermott, D., FINDING OBJECTS WITH GIVEN SPATIAL PROPERTIES, Yale U., 1981

McDermott, D., NON-MONOTONIC LOGIC II:  NON-MONOTONIC MODAL TTHEORIES
  CSD Yale U., Feb. l980

McWilliams and Widdoes, THE SCALD PHYSICAL DESIGN SUBSYSTEM, Stanford U., 1978

McWilliams and Widdoes, SCALD:  STRUCTURED COMPUTER-AIDED LOGIC DESIGN, Stanford
  U., 1978

Mellish, C.S., AUTOMATIC GENERATION OF MODE DECLARATIONS FOR PROLOG PROGRAMS,
  Edinburgh

Mellish, C. S., CONTROLLING INFERENCE IN THE SEMATNIC INTERPRETATION OF MECHANICS
  PROBLEMS, U. of Edinburgh

Meseguer, Jose, VARIETIES OF CHAIN-COMPLETE ALGEBRAS.  U. of California, 1981
 
Meyer and Winklmann, ON THE EXPRESSIVE POWER OF DYNAMIC LOGIC, MIT, 1980

Meyer, Streett, and Mirkowska, THE DEDUCIBILITY PROBLEM IN PROPOSITIONAL
  DYNAMIC LOGIC, 1981, MIT

Millwe, John J.H., ON THE CONVERGENCE, UNIFORMLY IN ε, OF DIFFERENCE SCHEMES
  FOR A TWO POINT BOUNDARY SINGULAR PERTURBATION PROBLEM, 1978

Miller & Zraket, NEAR-TERM RESPONSE TTO AN OIL CUTOFF: SOLAR AND OTHER

Minsky, Marvin, NATURE ABHORS AN EMPTY VACUUM, MIT Lab, 1981

Minsky, Marvin, TOWARD A REMOTELY MANNED ENERGY AND PRODUCTION ECONOMY,
  MIT, 1979

MIT, MAC TR-123, INTRODUCTION TO MULTICS (The Multiplexed Information and
  Computing Service), Programmers' Manual, 1973

Mitre Corp., ANALYSIS OF NATIONAL ENERGY PLANS.  Nov. l979

Mitre Corp., TOWARD A NATIONAL PLAN FOR THE ACCELERATED COMMERCIALIZATION
  OF SOLAR ENERGY.  JAN. 1980

Moore, R. C., AUTOMATIC DEDUCTION FOR COMMONSENSE REASONING; AN OVERVIEW,
  Tech Note, SRI, 1981

Moore, R. C., PROBLEMS IN LOGICAL FORM, Tech. Note, SRI, 1981


Montgomery, C. and Ruspini, E., THE ACTIVE INFORMATION SYSTEM:  A DATA-DRIVEN
  SYSTEM FOR THE ANALYSIS OF IMPRECISE DATA, IEEE, 1981

Moriconi and Schwartz, AUTOMATIC CONSTRUCTION OF VERIFICATION CONDITION
  GENERATORS FROM HOARE LOGICS.  SRI, April 1981.

Moszkowski, Ben, TEMPORAL LOGIC FOR DIGITAL CIRCUITS.  March 1981

Moynihan, Daniel, JOINING THE JACKALS, THE U.S. AT THE UN 1977-1980

National Research Council, OUTLOOK FOR SCIENCE AND TECHNOLOGY: THE NEXT FIVE
  YEARS.  April 1981.

Newell, Allen, DUNCKER ON THINGING:  AN INQUIRY INTO PROGRESS IN COGNITION,
  Carnegie-Mellon U., 1981

Newell, Allen, THE KNOWLEDGE LEVEL.  Carnegie-Mellon U., January 1981.

Newell, Allen,  PHYSICAL SYMBOL SYSTEMS.  C-M U.  March 1980

North Holland computer publications survey, 1980

Ollongren, Alexander, ON THE IMPLEMENTATION OF PARTS OF META-IV IN LISP,
  Linkoping U., 1981

Oppen, Derek, PRETTY PRINTING (given to clt, 3-9-8l)

Oshins and McGoveran, THOUGHTS ABOUT LOGIC ABOUT THOUGHTS...:  THE QUESTION
  "SCHIZOPHRENIA?", 1980

Owicki and Lamport, PROVING LIVENESS PROPERTIES OF CONCURRENT PROGRAMS.
  Stanford U., October 1980

Pamphlets, NUCLEAR ENERGY.  May 1981.

Parikh, Rohit, PROPOSITIONAL DYNAMIC LOGICS OF PROGRAMS:  A SURVEY, 1981, MIT

Pasztorne- Varga, K., A SOLUTION OF A CAD PROBLEM IN PROLOG, Budapect


Pavelle & Wester, COMPUTER PROGRAMS FOR RESEARCH IN GRAVITATION AND
  DIFFERENTIAL GEOMETRY.  MIT, Lab for Computer Science, June l980

Pereira, Fernando, SOME TECHNIQUES FOR WRITING GRAMMERS IN LOGIC, U. of Lisbon,
  1981

Pereira, Luis M., BACKTRACKING INTELLIGENTLY IN AND/OR TREES, 1979

Pereira, Luis M., MAQUINAS HUMANAS, U. of Lisboa, 1980

Pereira and Porto, SELECTIVE BACKTRACKING INTERPRETER, July 1981

Perlis, Donald, LANGUAGE, COMPUTATION, AND REALITY, U. of Rochester, 1981

Perry, John, PERCEPTION, ACTION, AND THE STRUCTURE OF BELIEVING, 1981

Pinker, Steven, MENTAL IMAGERY AND THE VISUAL WORLD, 1979

Powers, Lawrence, KNOWLEDGE BY DEDUCTION, The Philosophical Review, 1978

Prince, Alan, A METRICAL THEORY OF ESTONIAN QUANTITY, 1979

Pratt, Vaughan, DYNAMIC ALGEBRAS AND THE NATURE OF INDUCTION, MIT, 1980

Putnam, Hilary, COMPUTATIONAL SCYCHOLOGY AND INTERPRETATION THEORY, 

Putnam, Hilary, REFLECTIONS ON GOODMAN'S WAYS OF WORLDMAKING, Journal of
  Philosophy, 1979

Redko, SEMANTICS (Russian)

Reboh, Rene, KNOWLEDGE ENGINEERING TECHNIQUES AND TOOLS FOR EXPERT SYSTEMS,
  LINOPING U., 1981

Reiter, Ray, TOWARDS A LOGICAL RECONSTRUCTION OF RELATIONAL DATABASE THEORY, 
  U. of British Columbia, 1981

Rochester, University of, COMPUTER SCIENCE ENGINEERING RESEARCH REVIEW, 1981

Rosenfeld, Azriel, IMAGE PATTERN RECOGNITION. U. of Maryland, January l980.

Rosenschein, and Katz, SELECTION OF REPRESENTATIONS FOR DATA STRUCTURES, 
  Israel Scientific Center, 1977

Roth, Frederick, MATCHING AND ABSTRACTION IN KNOWLEDGE SYSTEMS.  Rand Corp.,
  Jan. 1980

Rozycki, E. G., THE FUNCTIONAL ANALYSIS OF BEHAVIOR.  1975

Sabatier, P. and Pereira, L.M., ORBI'S GRAMMER, 


Salisbury, Robert, AN EXCHANGE THEORY OF INTEREST GROUPS, 1969


Samet, Hanan, NEIGHBOR FINDING TECHNIUES FOR IMAGES REPRESENTED BY QUADTREES
  U. of Maryland, January, l980.

Sato, Masahiko, THEORY OF SYMBOLIC EXPRESSIONS.  U. of Tokyo, September 1980

Sato and Hagiya, HYPERLISP

Schimanovich, Werner, AN AXIOMATIC THEORY OF WINNING MATHEMATICAL GAMES AND ECONOMIC
  ACTIONS, U. of Vienna, 1981

Seaquist, Carl, A SEMANTICS OF SSYNCHRONIZATION.  Lab for CS, MIT.  Setp. l980

Searle, John R., MINDS, BRAINS, AND PROGRAMS, Cambridge University Press, 1980

Searle, John R., REFERENTIAL AND ATTRIBUTIVE, 

Searle, John R., REPLY TO FODOR`S METHODOLOGICAL SOLIPSISM

Shapiro, Ehud, AN ALGORITHM THAT INFERS THEORIES FROM FACTS, Yale U., 1981

Shapiro, Ehud, ALGORITHMIC PROGRAM DEBUGGING, Yale U., 1981

Shapiro, Ehud, INDUCTIVE INFERENCE OF THEORIES FROM FACTS.  Yale U., Feb. 1981

Shapiro, Stuart, SNEPSLOG, A HIGHER ORDER LOGIC PROGRAMMING LANGUAGE, SSNY, Buffalo,
  1981

Shapiro, Stuart, SNERG, SUNY at Buffalo, 1981

Shaw, Mary, THE IMPACT OF ABSTRACTION CONCERNS ON MODERN PROGRAMMING LANGUAGES.
  C-M U., April 1980

Smith et al, A VERIFIED ENCRYPTED PACKET INTERFACE.  U. of Texas, April 1981.
  for Workshop on Program Verification.

Stanford Computer Forum, BOOKLET OF VIEWGRAPHS 1981

Steeb, Cammarata, Hayes-Roth, Thorndyke, Wesson, DISTRIBUTED INTELLIGENCE
  FOR AIR FLEET CONTROL, Rand, 1981

Steele, Guy, A CHARACTER STANDARD OF LISP (Revision 5), Carnegie-Mellon U.
  April 1981

Stromf;ors and Jonesjo, THE IMPLEMENTATION AND EXPERIENCES OF A STRUCTURE-
  ORIENTED TEXT EDITOR, Linkoping U., 1981

Svobodova, Liba, MANAGEMENT OF OBJECT HISTORIES IN THE SWALLOW REPOSITORY.
  MIT, Lab for Computer Science, July, l980.

Sweeney, J.L., ENERGY POLICY ISSUES FOR THE EIGHTIES. Energy Modeling Forum,
  Stanford University, April 1980

Schwind, Camilla, A COMPLETENESS PROOF FOR A LOGIC OF ACTIONS, Marseilles, 1980

Takahashi, Hideyuki, AN AUTOMATIC CONTROLLER DESCRIPTION LANGUAGE,Nihon U., 1980

Thorndike, McArthur and Cammarata, AUTOPILOT:  A DISTRIBUTED PLANNER FOR AIRFLEET
  CONTROL, Rand Note, 1981

Tichy, Walter, SOFTWARE DEVELOPMENT CONTROL BASED ON SYSTEM STRUCTURE DESCRIPTION.
  C-M U.  January 1980

Tarski, Alfred, A SIMPLIFIED FORMALIZATION OF PREDICATE LOGIC WITH IDENTITY.
  Berkeley

Morris, F.L., and Jones, C.B., AN EARLY PROGRAM PROOF BY ALAN TURING.
  Syracuse University and Manchester University.  

Turner, Raymond, COUNTERFACTUALS WITHOUT POSSIBLE WORLDS, 

Van Emden, M. H. and Kowalski, R. A., THE SEMANTICS O PREDICATE LOGIC
  AS A PROGRAMMING LANGUAGE, U. of Edinburgh, 1976

Vauquois, B., ASPECTS OF MECHANICAL TRANSLATION IN 1979.  U. of Grenoble,
  July l979

Walker, Adrian, ON RETRIEVAL FROM A SMALL VERSION OF A LARGE DATA BASE.
  Bell Laboratories.  October 1980.

Wang, Hao, SOME FACTS ABOUT KURT GODEL, Journal of Symbolic Logic, 1981

Weihl, William, INTERPROCEDURAL DATA FLOW ANALYSIS IN THE PRESENCE OF POINTERS....

Wesson, R., F, Hayes-Roth.  NETWORK STRUCTURES FOR DISTRIBUTED SITUATION
  ASSESSMENT.  Report for DARPA.  August 1980

Williams, George M., THE OPACITY OF REAL CONSPIRACIES

Wimsatt, William, REDUCTIONISTIC RESEARCH STRATEGIES AND THEIR BIASES IN THE
  UNITS OF SELECTION CONTROVERSY, 1980

Wimsatt, William, ROBUSTNESS, RELIABILITY AND OVERDETERMINATION IN SCIENCE, 1980

Wise, David, MORRIS'S GARBAGE COMPACTION ALGORITHM RESTORES REFERENCE COUNTS, 
  Indiana U., 1979

Wise and Friedman, THE ONE-BIT REFERENCE COUNT, NSF, 1977

Woods, W. A., PROCEDURAL SEMANTICS AS A THEORY OF MEANING, 1979
  
Xerox Palo Alto Research Center, Abstracts of Recent Research, Cognitive and
  Instructional Sciences.  Spring 1981

Xerox Palo Alto Research Center, THE DORADO:  A HIGH-PERFORMANCE PERSONAL
  COMPUTER, THREE PAPERS, l981

Yannakakis and Papadimitriou, ALGEBRAIC DEPENDENCIES, MIT

Zraket & Scholl, SOLAR ENERGY SYSTEMS AND RESOURCES. MITRE CORP.